Efficient Quasi-Adaptive NIZK
نویسنده
چکیده
This report gives an overview of the Quasi-Adaptive NonInteractive Zero Knowledge proof system introduced recent papers by Joy and Rutla ([JR13a,JR13b]). This system reduces the proof size for linear subspace languages to constant-sized proofs under the k-linear assumption.
منابع مشابه
Quasi-Adaptive NIZK for Linear Subspaces Revisited
Non-interactive zero-knowledge (NIZK) proofs for algebraic relations in a group, such as the GrothSahai proofs, are an extremely powerful tool in pairing-based cryptography. A series of recent works focused on obtaining very efficient NIZK proofs for linear spaces in a weaker quasi-adaptive model. We revisit recent quasiadaptive NIZK constructions, providing clean, simple, and improved construc...
متن کاملNon-malleability from Malleability: Simulation-Sound Quasi-Adaptive NIZK Proofs and CCA2-Secure Encryption from Homomorphic Signatures
Verifiability is central to building protocols and systems with integrity. Initially, efficient methods employed the Fiat-Shamir heuristics. Since 2008, the Groth-Sahai techniques have been the most efficient in constructing non-interactive witness indistinguishable and zero-knowledge proofs for algebraic relations. For the important task of proving membership in linear subspaces, Jutla and Roy...
متن کاملSwitching Lemma for Bilinear Tests and Constant-Size NIZK Proofs for Linear Subspaces
We state a switching lemma for tests on adversarial responses involving bilinear pairings in hard groups, where the tester can effectively switch the randomness used in the test from being given to the adversary at the outset to being chosen after the adversary commits its response. The switching lemma can be based on any k-linear hardness assumptions on one of the groups. In particular, this e...
متن کاملEfficient Short Adaptive NIZK for NP
In Eurocrypt 2013, Gennaro et al. proposed an efficient non-adaptive short QAP-based NIZK argument for Circuit-SAT, where non-adaptivity means that the CRS depends on the statement to be proven. While their argument can be made adaptive by using universal circuits, this increases the prover computation by a logarithmic multiplicative factor. By following the QAP-based approach, we propose an ef...
متن کاملSmooth NIZK Arguments with Applications to Asymmetric UC-PAKE and Threshold-IBE
We introduce a novel notion of smooth (-verifier) noninteractive zero-knowledge proofs (NIZK) which parallels the familiar notion of smooth projective hash functions (SPHF). We also show that the recent single group element quasi-adaptive NIZK (QA-NIZK) of Jutla and Roy (CRYPTO 2014) for linear subspaces can be easily extended to be computationally smooth. One important distinction of the new n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014